The Hausdorff-Kuratowski Hierarchy of omega-Regular Languages and a Hierarchy of Muller Automata
نویسنده
چکیده
R. Barua, The Hausdorff-Kuratowski hierarchy of o-regular languages and a hierarchy of Muller automata, Theoretical Computer Science 96 (1992) 345-360. Given a finite alphabet Z, we give a simple characterization of those Gd subsets of Z” which are deterministic w-regular (i.e. accepted by Biichi automata) over Z and then characterize the w-regular languages in terms of these (rational) G6 sets. Our characterization yields a hierarchy ofw-regular languages similar to the classical difference hierarchy of Hausdorff and Kuratowski for 4 i seti (i.e. the class of sets which are both Fo, and GA.). We then prove that the Hausdorff-Kuratowski difference hierarchy of d i when restricted to o-regular languages coincides with our hierarchy. We obtain this by showing that if an w-regular language K can be separated from another w-regular language L by the union of alternate differences of a decreasing sequence of G6 sets of length n, then there is a decreasing sequence (of length n) of rational Cd sets such that the union of alternate differences separates K from L. Our results not only generalize a result of Landweber (1969), but also yield an effective procedure for determining the complexity of a given Muller automaton. We also show that our hierarchy does not collapse, thus, giving a fine classification of w-regular languages and of Muller automata.
منابع مشابه
Fine Hierarchy of Regular ω-Languages
By applying descriptive set theory to the Wagner’s fine structure of regular ω-languages we get quite different proofs of his results and obtain new results. We give an automata-free description of the fine structure. We present also a simple property of a deterministic Muller automaton equivalent to the condition that the corresponding regular ω-language belongs to any given level of the fine ...
متن کاملBorel Ranks and Wadge Degrees of Context Free omega-Languages
We show that the Borel hierarchy of the class of context free ω-languages, or even of the class of ω-languages accepted by Büchi 1-counter automata, is the same as the Borel hierarchy of the class of ω-languages accepted by Turing machines with a Büchi acceptance condition. In particular, for each recursive non null ordinal α, there exist some Σ α -complete and some Π α -complete ω-languages ac...
متن کاملAcceptance conditions for omega-languages and the Borel hierarchy
This paper investigates acceptance conditions for finite automata recognizing ω-regular languages. As a first result, we show that, under any acceptance condition that can be defined in the MSO logic, a finite automaton can recognize at most ω-regular languages. Starting from this, the paper aims at classifying acceptance conditions according to their expressive power and at finding the exact p...
متن کاملA Complexity Measure on Büchi Automata
We define a complexity measure on non-deterministic Büchi automata, based on the notion of the width of the skeleton tree introduced by Kähler and Wilke. We show that the induced hierarchy tightly correlates to the Wagner Hierarchy, a corner stone in the theory of regular ω-languages that is derived from a complexity measure on deterministic Muller automata. The relation between the hierarchies...
متن کاملOn the Length of the Wadge Hierarchy of Omega-Context Free Languages
We prove in this paper that the length of the Wadge hierarchy of ω-context free languages is greater than the Cantor ordinal εω, which is the ω th fixed point of the ordinal exponentiation of base ω. We show also that there exist some Σ0ω-complete ω-context free languages, improving previous results on ω-context free languages and the Borel hierarchy.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 96 شماره
صفحات -
تاریخ انتشار 1992